| 翻訳と辞書 |
| online codes ： ウィキペディア英語版 |
online codes
In computer science, online codes are an example of rateless erasure codes. These codes can encode a message into a number of symbols such that knowledge of any fraction of them allows one to recover the original message (with high probability). ''Rateless'' codes produce an arbitrarily large number of symbols which can be broadcast until the receivers have enough symbols.
The online encoding algorithm consists of several phases. First the message is split into ''n'' fixed size message blocks. Then the ''outer encoding'' is an erasure code which produces auxiliary blocks that are appended to the message blocks to form a composite message.
From this the inner encoding generates check blocks. Upon receiving a certain number of check blocks some fraction of the composite message can be recovered. Once enough has been recovered the outer decoding can be used to recover the original message.
==Detailed discussion==
Online codes are parameterised by the block size and two scalars, ''q'' and ''ε''. The authors suggest ''q''=3 and ε=0.01. These parameters set the balance between the complexity and performance of the encoding. A message of ''n'' blocks can be recovered, with high probability, from (1+3ε)''n'' check blocks. The probability of failure is (ε/2)q+1.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「online codes」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|